Study on Harmonic Impedance Estimation and Harmonic Contribution Evaluation Index
نویسندگان
چکیده
منابع مشابه
On Harmonic Index and Diameter of Unicyclic Graphs
The Harmonic index $ H(G) $ of a graph $ G $ is defined as the sum of the weights $ dfrac{2}{d(u)+d(v)} $ of all edges $ uv $ of $G$, where $d(u)$ denotes the degree of the vertex $u$ in $G$. In this work, we prove the conjecture $dfrac{H(G)}{D(G)} geq dfrac{1}{2}+dfrac{1}{3(n-1)} $ given by Jianxi Liu in 2013 when G is a unicyclic graph and give a better bound $ dfrac{H(G)}{D(G)}geq dfra...
متن کاملOn the harmonic index and harmonic polynomial of Caterpillars with diameter four
The harmonic index H(G) , of a graph G is defined as the sum of weights 2/(deg(u)+deg(v)) of all edges in E(G), where deg (u) denotes the degree of a vertex u in V(G). In this paper we define the harmonic polynomial of G. We present explicit formula for the values of harmonic polynomial for several families of specific graphs and we find the lower and upper bound for harmonic index in Caterpill...
متن کاملOn the harmonic index of bicyclic graphs
The harmonic index of a graph $G$, denoted by $H(G)$, is defined asthe sum of weights $2/[d(u)+d(v)]$ over all edges $uv$ of $G$, where$d(u)$ denotes the degree of a vertex $u$. Hu and Zhou [Y. Hu and X. Zhou, WSEAS Trans. Math. {bf 12} (2013) 716--726] proved that for any bicyclic graph $G$ of order $ngeq 4$, $H(G)le frac{n}{2}-frac{1}{15}$ and characterize all extremal bicyclic graphs.In this...
متن کاملOptimal Estimation of Harmonic Components Using ISFLA
In this paper a novel method based on evolutionary algorithms is presented to estimate the harmonic components. In general, the optimization of the harmonic estimation process is a multi-component problem, in which evaluation of the phase and harmonic frequency is the nonlinear part of the problem and is solved based on the mathematical and evolutionary methods; while estimation of amplitude of...
متن کاملon the harmonic index and harmonic polynomial of caterpillars with diameter four
the harmonic index h(g) , of a graph g is defined as the sum of weights 2/(deg(u)+deg(v)) of all edges in e(g), where deg (u) denotes the degree of a vertex u in v(g). in this paper we define the harmonic polynomial of g. we present explicit formula for the values of harmonic polynomial for several families of specific graphs and we find the lower and upper bound for harmonic index in caterpill...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2020.2982950